CORAL: Solving Complex Constraints for Symbolic PathFinder
نویسندگان
چکیده
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in practice is its inability to handle complex mathematical constraints. To address the problem, we have integrated CORAL’s heuristic solvers into NASA Ames’ Symbolic PathFinder symbolic execution tool. CORAL’s solvers have been designed to deal with mathematical constraints and their heuristics have been improved based on examples from the aerospace domain. This integration significantly broadens the application of Symbolic PathFinder at NASA
منابع مشابه
jFuzz: A Concolic Whitebox Fuzzer for Java
We present jFuzz, a automatic testing tool for Java programs. jFuzz is a concolic whitebox fuzzer, built on the NASA Java PathFinder, an explicit-state Java model checker, and a framework for developing reliability and analysis tools for Java. Starting from a seed input, jFuzz automatically and systematically generates inputs that exercise new program paths. jFuzz uses a combination of concrete...
متن کاملJPF-SE: A Symbolic Execution Extension to Java PathFinder
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and explore symbolic execution paths and it uses off-the-shelf decision procedures to manipulate numeric constraints.
متن کاملEvaluation of Java PathFinder Symbolic Execution Extension
Executions of a system can follow di erent execution paths depending on the inputs to the system. In symbolic execution constraints over input values are generated during execution and these constraints are used to guide the execution so that every distinct execution path will be covered. Symbolic execution has gained a renewed interest among researchers since the recent advancements in decisio...
متن کاملVerification of Java Programs Using Symbolic Execution and Invariant Generation
Softm-are verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic esecution, for the automated verification of software. The framework uses annotations in the form of method specifications an3 loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants ...
متن کاملVeri cation of Java Programs using Symbolic Execution and Invariant Generation Corina S
Software veri cation is recognized as an important and difcult problem. We present a novel framework, based on symbolic execution, for the automated veri cation of software. The framework uses annotations in the form of method speci cations and loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011